An architecture independent study of parallel segment trees
نویسندگان
چکیده
منابع مشابه
An architecture independent study of parallel segment trees
In this work we study the computation, communication and synchronization requirements related to the construction and search of parallel segment trees in an architecture independent way. Our proposed algorithms are optimal in space and time compared to the sequential algorithms utilized to solve the corresponding problems and are described in the context of the Bulk-Synchronous Parallel (BSP) m...
متن کاملOuter independent Roman domination number of trees
A Roman dominating function (RDF) on a graph G=(V,E) is a function f : V → {0, 1, 2} such that every vertex u for which f(u)=0 is adjacent to at least one vertex v for which f(v)=2. An RDF f is calledan outer independent Roman dominating function (OIRDF) if the set ofvertices assigned a 0 under f is an independent set. The weight of anOIRDF is the sum of its function values over ...
متن کاملParallel Generation of t-ary Trees
A parallel algorithm for generating t-ary tree sequences in reverse B-order is presented. The algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time O(1). The algorithm is executed on a CREW SM SIMD model, and is adaptive and cost-optimal. Prior to the discussion of the parallel algorithm a new sequential generation with O(1) average time ...
متن کاملAn Architecture-Independent Software Development Approach for Parallel Processing Systems
In th is paper, a n architecture-independent software development approach for parallel processing sy s t ems i s presented. T h i s approach is based o n the parallel objectoriented and func t ional computa t ion model PROOF and separates the architecture dependent issues f r o m software development. I t also facil i tates software developm e n t for any parallel processing sys tems by reliev...
متن کاملC3: an architecture-independent model for coarse-grained parallel machines
We propose an architecture-independent parallel model, the C 3-model. The C 3-model evaluates, for a given parallel algorithm and target architecture, the complexity of computation, the pattern of communication , and the potential congestion arising in communication operations. A metric for estimating the eeect of link and processor congestion on the performance of an arbitrary communication op...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2006
ISSN: 1570-8667
DOI: 10.1016/j.jda.2005.01.001